The determinants of matrices with recursive entries

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

Some Matrices with Nilpotent Entries, and Their Determinants

The present note is really a Section in a forthcoming treatise [4] on differential forms in the context of Synthetic Differential Geometry (elaborating on [2], [3], [1]); but since the methods of this Section fall entirely within elementary linear algebra over a commutative ring R, we believe that it might be of more general interest, and worthwile a separate publication. The base ring R over w...

متن کامل

An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries

The objective of this paper is to gain some insight into how well sparsity is preserved under determinant computations. For a square matrix A whose elements are indeterminates x1, . . . , xn and zeros, the determinant det(A) is a polynomial in x1, . . . , xn with integer coefficients. We derive an upper bound on the number of monomials in det(A) for a class of determinants which includes bigrad...

متن کامل

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

Extension of matrices with Laurent polynomial entries

Let P and Q be nr, r n matrices with Laurent polynomial entries. Suppose that Q T (z)P (z) = I r , z 2 Cnf0g. This note provides an algorithmatic construction of two n(nr) matrices G and H with Laurent polynomial entries such that the nn matrices

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2008

ISSN: 0024-3795

DOI: 10.1016/j.laa.2007.11.021